A Retrieval Algorithm for Time-constrained Heterogeneous Data Items in Wireless Networks

<p>Homogeneous and heterogeneous data retrieval problem refers that these requested items are retrieved on the basis of broadcast at some channels such access latency all is minimized. The has an important study significance in MIMO (Multiple Input Multiple Output) wireless communication. Almost researches focused proposing schemes for solving signal antenna or multiple antennae based homogeneous items, but not suitable problem. So this paper, we describe a SPR (Shortest Paths Retrieval) algorithm same time. Moreover, avoiding time too long, when each item set constrained condition-deadline, propose another DKPR (Deadline-based Key Path finds critical path with largest number cycle, so as to complete operation within deadline requesting much possible. Through experiments, proposed scheme good efficiency. </p> <p> </p>